Уноси
Search full-text
"Guenther Raidl"
-
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem (2024)
J. Reixach, C. Blum, M. Đukanović, G. Raidl, A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem, LNCS, pp. 1 - 15, 2024 -
A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem (2024-06)
J. Reixach, C. Blum, M. Đukanović, G. Raidl, A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem, IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, Jun, 2024 -
Signed double Roman domination on cubic graphs (2024-02)
E. Iurlano, Т. Зец, M. Đukanović, G. Raidl, Signed double Roman domination on cubic graphs, APPLIED MATHEMATICS AND COMPUTATION, Vol. 471, pp. 1 - 15, Feb, 2024 -
Anytime algorithms for the longest common palindromic subsequence problem (2020-02)
M. Đukanović, G. Raidl, C. Blum, Anytime algorithms for the longest common palindromic subsequence problem, COMPUTERS & OPERATIONS RESEARCH, Vol. 114, pp. Article - 104827, Feb, 2020 -
Finding Longest Common Subsequences: New anytime A∗ search results (2020-10)
M. Đukanović, G. Raidl, C. Blum, Finding Longest Common Subsequences: New anytime A∗ search results, APPLIED SOFT COMPUTING, Vol. 95, pp. Article - 106499, Oct, 2020 -
Solving longest common subsequence problems via a transformation to the maximum clique problem (2021-01)
C. Blum, M. Đukanović, A. Santini, H. Jiang, C. Li, F. Manya, G. Raidl, Solving longest common subsequence problems via a transformation to the maximum clique problem, COMPUTERS & OPERATIONS RESEARCH, Vol. 125, pp. Article - 105089, Jan, 2021 -
An A* search algorithm for the constrained longest common subsequence problem (2021-02)
M. Đukanović, C. Berger, G. Raidl, C. Blum, An A* search algorithm for the constrained longest common subsequence problem, INFORMATION PROCESSING LETTERS, Vol. 166, pp. Article - 106041, Feb, 2021 -
Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences (2022-04)
M. Đukanović, А. Картељ, Д. Матић, М. Грбић, C. Blum, G. Raidl, Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences, APPLIED SOFT COMPUTING, pp. 108844 - 108844, Apr, 2022 -
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem (2019-02)
M. Đukanović, G. Raidl, C. Blum, A Heuristic Approach for Solving the Longest Common Square Subsequence Problem, Lecture Notes in Computer Science, pp. 429 - 437, Feb, 2019 -
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation (2020-09)
M. Đukanović, G. Raidl, C. Blum, A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation, LNCS, pp. 154 - 167, Sep, 2020 -
On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence (2021)
M. Horn, M. Đukanović, G. Raidl, C. Blum, On the Use of Decision Diagrams for the Repetition-Free Longest Common Subsequence, The Book of Extended Abstracts of CPAIOR 2020. Paper 97., pp. 1 - 2, 2021 -
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem (2021-06)
M. Đukanović, G. Raidl, C. Blum, Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem, Lecture Notes in Computer Science, pp. 199 - 214, Jun, 2021 -
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences (2021-09)
M. Horn, M. Đukanović, G. Raidl, C. Blum, On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences, Lecture Notes in Computer Science, pp. 134 - 149, Sep, 2021 -
On Solving a Generalized Constrained Longest Common Subsequence Problem (2021-09)
M. Đukanović, C. Berger, G. Raidl, C. Blum, On Solving a Generalized Constrained Longest Common Subsequence Problem, Lecture Notes in Computer Science, pp. 55 - 70, Sep, 2021